Section: New Results

FFS factory

Participant : Jérémie Detrey [contact] .

An extension of Coppersmith's “factorization factory” and Barbulescu's “discrete logarithm factory” to the Function Field Sieve was proposed, dubbed the “FFS factory” [28] . The idea is to batch discrete logarithm computations in finite fields of different extension degrees, sharing the sieving step on the algebraic side between all these finite fields. A careful analysis proved that this approach can be used to lower the overall asymptotic complexity. This was also illustrated with a practical experiment in which the discrete logarithm problem was solved for all of the 50 binary fields of the form ${𝔽}_{2^n}$ with $n$ odd ranging from 601 to 699.